Optimization of Dispatching Strategies for Stacking Cranes Including Remarshaling Jobs

Scheduling co-operating stacking cranes with predetermined container sequences

Crane scheduling in container terminals is known as a difficult optimization problem that has become even more challenging in recent years with the proliferation of multi-gantry automated stacking cranes. In this paper we present an efficient algorithm solving a subproblem arising in this context, namely deciding the priority of cranes after transportation tasks have been assigned. We tackle th...

Stochastic Dispatching of Multi-priority Jobs to Heterogeneous Processors

A number of multi-priority jobs are to be processed on two heterogeneous processors. Of the jobs waiting in the buffer, jobs with the highest priority have the first option of being dispatched for processing when a processor becomes available. On each processor, the processing times of the jobs within each priority class are stochastic, but have known distributions with decreasing mean residual...

Simulating Dispatching Strategies for Automated Container Terminals

Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput

We consider online, nonpreemptive scheduling of equal-length jobs on parallel machines. Jobs have arbitrary release times and deadlines and a scheduler’s goal is to maximize the number of completed jobs (Pm | rj , pj = p | P 1− Uj). This problem has been previously studied under two distinct models. In the first, a scheduler must provide immediate notification to a released job as to whether it...

Optimization Models for Scheduling of Jobs

This work is motivated by a particular scheduling problem that is faced by logistics centers that perform aircraft maintenance and modification. Here we concentrate on a single facility (hangar) which is equipped with several work stations (bays). Specifically, a number of jobs have already been scheduled for processing at the facility; the starting times, durations, and work station assignment...